// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int n,m,MOD=80112002;
vector<int> v[5001],in,out,z;
signed main()
{
	cin>>n>>m;
	z=in=out=vector<int> (n+1);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		v[x].push_back(y);
		out[x]++;
		in[y]++;
	}
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		if(!in[i])
		{
			q.push(i);
			z[i]=1;
		}
	}
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		for(int i=0;i<v[x].size();i++)
		{
			z[v[x][i]]=(z[v[x][i]]+z[x])%MOD;
			if(--in[v[x][i]]==0)
			{
				q.push(v[x][i]);
			}
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		if(!out[i])ans=(ans+z[i])%MOD;
	}
	cout<<ans;
	return 0;
}
